An inexact Newton method combined with Hestenes multipliers' scheme for the solution of Karush-Kuhn-Tucker systems
نویسندگان
چکیده
In this work a Newton interior–point method for the solution of Karush– Kuhn–Tucker systems is presented. A crucial feature of this iterative method is the solution, at each iteration, of the inner subproblem. This subproblem is a linear–quadratic programming problem, that can solved approximately by an inner iterative method such as the Hestenes multipliers’ method. A deep analysis on the choices of the parameters of the method (perturbation and damping parameters) has been done. The global convergence of the Newton interior–point method is proved when it is viewed as an inexact Newton method for the solution of nonlinear systems with restriction on the sign of some variables. The Newton interior–point method is numerically evaluated on large scale test problems arising from elliptic optimal control problems which show the effectiveness of the approach.
منابع مشابه
An Analysis of Newton ' s Method for
In this paper we analyze the application of Newton's method to the solution of systems of nonlinear equations arising from equivalent forms of the rst{order Karush{Kuhn{Tucker necessary conditions for constrained optimization. The analysis is carried out by using an abstract model for the original system of nonlinear equations and for an equivalent form of this system obtained by a reformulatio...
متن کاملA Semismooth Inexact Newton-type Method for the Solution of Optimal Power Flow Problem
The paper presents a semismooth inexact Newton-type method for solving optimal power flow (OPF) problem. By introducing the nonlinear complementarity problem (NCP) function, the Karush-KuhnTucker (KKT) conditions of OPF model are transformed equivalently into a set of semismooth nonlinear algebraic equations. Then the set of semismooth equations can be solved by an improved inexact LevenbergMar...
متن کاملParallel Full Space SQP Lagrange-Newton-Krylov-Schwarz Algorithms for PDE-Constrained Optimization Problems
Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for the parallel numerical solution of such problems involve sequential quadratic programming (SQP), with either reduced or full space approaches. In this paper we propose and investigate a class of parallel full space SQP Lagrange...
متن کاملDomain Decomposition Methods for PDE Constrained Optimization Problems
Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for the parallel numerical solution of such problems involve sequential quadratic programming (SQP), with either reduced or full space approaches. In this paper we propose and investigate a class of parallel full space SQP Lagrange...
متن کاملOptimization Tutorial 2 : Newton ’ s Method , Karush - Kuhn - Tucker ( KKT ) Conditions 3 3 Constrained Optimization and KKT Optimality Conditions
In the first part of the tutorial, we introduced the problem of unconstrained optimization, provided necessary and sufficient conditions for optimality of a solution to this problem, and described the gradient descent method for finding a (locally) optimal solution to a given unconstrained optimization problem. We now describe another method for unconstrained optimization, namely Newton’s metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 168 شماره
صفحات -
تاریخ انتشار 2005